SSA, SVD, QR-cp, and RBF Model Reduction

نویسندگان

  • Moisés Salmerón
  • Julio Ortega
  • Carlos García Puntonet
  • Alberto Prieto
  • Ignacio Rojas
چکیده

We propose an application of SVD model reduction to the class of RBF neural models for improving performance in contexts such as on-line prediction of time series. The SVD is coupled with QR-cp factorization. It has been found that such a coupling leads to more precise extraction of the relevant information, even when using it in an heuristic way. Singular Spectrum Analysis (SSA) and its relation to our method is also mentioned. We analize performance of the proposed on-line algorithm using a “benchmark” chaotic time series and a difficult-to-predict, dynamically changing series.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved RAN sequential prediction using orthogonal techniques

A new learning strategy for time-series prediction using radial basis function (RBF) networks is introduced. Its potential is examined in the particular case of the resource allocating network model, although the same ideas could apply to extend any other procedure. In the early stages of learning, addition of successive new groups of RBFs provides an increased rate of convergence. At the same ...

متن کامل

Svd/qr Based Model Error Indicator Function

A new model error indicator function based on singular value decomposition (SVD) and QR permutation decomposition techniques is proposed. Since an updating problem including large numbers of updating parameters is usually ill-conditioned, a singular value decomposition technique is first used to determine the meaningful submatrix of the system data matrix. A QR permutation decomposition with co...

متن کامل

Kernel-based Weighted Discriminant Analysis with QR Decomposition and Its Application to Face Recognition

Kernel discriminant analysis (KDA) is a widely used approach in feature extraction problems. However, for high-dimensional multi-class tasks, such as faces recognition, traditional KDA algorithms have a limitation that the Fisher criterion is non-optimal with respect to classification rate. Moreover, they suffer from the small sample size problem. This paper presents two variants of KDA called ...

متن کامل

Draft version of July 7, 2009 EXPONENTIAL DICHOTOMY ON THE REAL LINE: SVD AND QR METHODS

In this work we show when and how techniques based on the Singular Value Decomposition (SVD) and the QR decomposition of a fundamental matrix solution can be used to infer if a system enjoys –or not– exponential dichotomy on the whole real line.

متن کامل

An Svd Updating Algorithm for Subspace Tracking

In this paper, we extend the well known QR-updating scheme to a similar but more versatile and generally applicable scheme for updating the singular value decomposition (SVD). This is done by supplementing the QR-updating with a Jacobi-type SVD procedure, where apparently only a few SVD steps after each QR-update su ce in order to restore an acceptable approximation for the SVD. This then resul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002